The capacity constraint physarum solver

Physarum polycephalum inspired algorithm (PPA) has attracted immense attention recently. By modeling real-world problems into a graph and adopting proper adaption equation, PPA could solve system optimization or user equilibrium problems. However, few PPA-based algorithms can tackle with capacity constraints, lacking the ability to control link flows in PPA. To this problem, novel framework, capacitated (CPPA), is proposed allow constraints toward flow demonstrate validity of CPPA, we have developed three applications i.e., CPPA for maximum-flow problem (CPPA-MF), minimum-cost–maximum-flow (CPPA-MCMF), link-capacitated traffic assignment (CPPA-CTAP). In experiments, CPPA-MF shows competitive performance among four baseline algorithms; CPPA-MCMF approximately 50% faster than CPPA-CTAP reduce oversaturated degree from 40% 1.5% compared original algorithm. The experimental results prove validation framework. also robust since it been successfully applied different scenarios. extends PPA’s application capacity-constrain might shed some lights on its future complex • one first solver frameworks general link-flow control. problem.